/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/06-symbeq_07-tricky_address2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 01:58:26,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 01:58:26,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 01:58:26,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 01:58:26,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 01:58:26,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 01:58:26,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 01:58:26,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 01:58:26,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 01:58:26,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 01:58:26,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 01:58:26,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 01:58:26,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 01:58:26,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 01:58:26,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 01:58:26,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 01:58:26,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 01:58:26,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 01:58:26,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 01:58:26,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 01:58:26,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 01:58:26,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 01:58:26,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 01:58:26,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 01:58:26,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 01:58:26,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 01:58:26,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 01:58:26,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 01:58:26,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 01:58:26,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 01:58:26,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 01:58:26,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 01:58:26,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 01:58:26,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 01:58:26,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 01:58:26,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 01:58:26,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 01:58:26,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 01:58:26,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 01:58:26,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 01:58:26,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 01:58:26,844 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-02-09 01:58:26,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 01:58:26,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 01:58:26,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 01:58:26,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 01:58:26,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 01:58:26,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 01:58:26,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 01:58:26,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 01:58:26,874 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 01:58:26,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 01:58:26,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 01:58:26,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:58:26,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 01:58:26,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 01:58:26,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 01:58:26,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 01:58:26,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 01:58:26,877 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 01:58:26,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 01:58:26,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-09 01:58:27,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 01:58:27,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 01:58:27,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 01:58:27,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 01:58:27,121 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 01:58:27,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i [2022-02-09 01:58:27,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df55ca72/604225221ce347e49e13e96636c666d6/FLAGc6b8aea76 [2022-02-09 01:58:27,627 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 01:58:27,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i [2022-02-09 01:58:27,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df55ca72/604225221ce347e49e13e96636c666d6/FLAGc6b8aea76 [2022-02-09 01:58:27,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df55ca72/604225221ce347e49e13e96636c666d6 [2022-02-09 01:58:27,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 01:58:27,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 01:58:27,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 01:58:27,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 01:58:27,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 01:58:27,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:58:27" (1/1) ... [2022-02-09 01:58:27,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3635a83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:27, skipping insertion in model container [2022-02-09 01:58:27,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:58:27" (1/1) ... [2022-02-09 01:58:27,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 01:58:27,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 01:58:28,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:58:28,056 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 01:58:28,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:58:28,143 INFO L208 MainTranslator]: Completed translation [2022-02-09 01:58:28,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28 WrapperNode [2022-02-09 01:58:28,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 01:58:28,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 01:58:28,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 01:58:28,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 01:58:28,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,207 INFO L137 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-02-09 01:58:28,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 01:58:28,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 01:58:28,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 01:58:28,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 01:58:28,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 01:58:28,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 01:58:28,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 01:58:28,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 01:58:28,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (1/1) ... [2022-02-09 01:58:28,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:58:28,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:28,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-09 01:58:28,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-09 01:58:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 01:58:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 01:58:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 01:58:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 01:58:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-09 01:58:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 01:58:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-09 01:58:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-09 01:58:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 01:58:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 01:58:28,307 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 01:58:28,465 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 01:58:28,466 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 01:58:28,737 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 01:58:28,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 01:58:28,743 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-09 01:58:28,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:58:28 BoogieIcfgContainer [2022-02-09 01:58:28,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 01:58:28,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 01:58:28,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 01:58:28,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 01:58:28,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 01:58:27" (1/3) ... [2022-02-09 01:58:28,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf0c2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:58:28, skipping insertion in model container [2022-02-09 01:58:28,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:28" (2/3) ... [2022-02-09 01:58:28,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf0c2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:58:28, skipping insertion in model container [2022-02-09 01:58:28,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:58:28" (3/3) ... [2022-02-09 01:58:28,754 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2022-02-09 01:58:28,758 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 01:58:28,759 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 01:58:28,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-09 01:58:28,759 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 01:58:28,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,814 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,814 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,815 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,815 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,815 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,822 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,822 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,822 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,822 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,822 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,822 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,823 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,823 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,825 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,825 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,831 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,833 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,833 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,833 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,833 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,833 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,833 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:28,835 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 01:58:28,869 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 01:58:28,874 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-09 01:58:28,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-09 01:58:28,885 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 103 transitions, 211 flow [2022-02-09 01:58:28,948 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1102 states, 1094 states have (on average 1.9542961608775138) internal successors, (2138), 1101 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 1102 states, 1094 states have (on average 1.9542961608775138) internal successors, (2138), 1101 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-09 01:58:28,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:28,962 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] [2022-02-09 01:58:28,962 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1298122157, now seen corresponding path program 1 times [2022-02-09 01:58:28,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:28,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685718895] [2022-02-09 01:58:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:28,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:29,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:29,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685718895] [2022-02-09 01:58:29,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685718895] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:29,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:29,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:58:29,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930637243] [2022-02-09 01:58:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:29,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 01:58:29,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 01:58:29,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 01:58:29,166 INFO L87 Difference]: Start difference. First operand has 1102 states, 1094 states have (on average 1.9542961608775138) internal successors, (2138), 1101 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:29,206 INFO L93 Difference]: Finished difference Result 1102 states and 2105 transitions. [2022-02-09 01:58:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 01:58:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-09 01:58:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:29,226 INFO L225 Difference]: With dead ends: 1102 [2022-02-09 01:58:29,226 INFO L226 Difference]: Without dead ends: 1090 [2022-02-09 01:58:29,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 01:58:29,232 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:29,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2022-02-09 01:58:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2022-02-09 01:58:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1080 states have (on average 1.9277777777777778) internal successors, (2082), 1089 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2082 transitions. [2022-02-09 01:58:29,313 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2082 transitions. Word has length 37 [2022-02-09 01:58:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:29,313 INFO L470 AbstractCegarLoop]: Abstraction has 1090 states and 2082 transitions. [2022-02-09 01:58:29,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2082 transitions. [2022-02-09 01:58:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-09 01:58:29,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:29,315 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] [2022-02-09 01:58:29,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 01:58:29,315 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:29,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash -779087186, now seen corresponding path program 1 times [2022-02-09 01:58:29,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:29,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050286836] [2022-02-09 01:58:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:29,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:29,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:29,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050286836] [2022-02-09 01:58:29,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050286836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:29,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:29,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 01:58:29,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895508569] [2022-02-09 01:58:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:29,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:58:29,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:29,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:58:29,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:58:29,397 INFO L87 Difference]: Start difference. First operand 1090 states and 2082 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:29,426 INFO L93 Difference]: Finished difference Result 1094 states and 2086 transitions. [2022-02-09 01:58:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:58:29,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-09 01:58:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:29,430 INFO L225 Difference]: With dead ends: 1094 [2022-02-09 01:58:29,431 INFO L226 Difference]: Without dead ends: 1094 [2022-02-09 01:58:29,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:58:29,432 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:29,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 184 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-02-09 01:58:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1091. [2022-02-09 01:58:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1081 states have (on average 1.9269195189639223) internal successors, (2083), 1090 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2083 transitions. [2022-02-09 01:58:29,461 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2083 transitions. Word has length 37 [2022-02-09 01:58:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:29,461 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 2083 transitions. [2022-02-09 01:58:29,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2083 transitions. [2022-02-09 01:58:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-09 01:58:29,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:29,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:58:29,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 01:58:29,469 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:29,472 INFO L85 PathProgramCache]: Analyzing trace with hash 624473633, now seen corresponding path program 1 times [2022-02-09 01:58:29,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:29,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079699060] [2022-02-09 01:58:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:29,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:29,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:29,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079699060] [2022-02-09 01:58:29,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079699060] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:29,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855328666] [2022-02-09 01:58:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:29,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:29,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:29,556 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-02-09 01:58:29,557 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-02-09 01:58:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:29,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-09 01:58:29,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:29,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:58:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:29,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855328666] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:58:29,884 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:58:29,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-09 01:58:29,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129926741] [2022-02-09 01:58:29,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:58:29,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 01:58:29,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 01:58:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-09 01:58:29,886 INFO L87 Difference]: Start difference. First operand 1091 states and 2083 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:29,950 INFO L93 Difference]: Finished difference Result 1101 states and 2093 transitions. [2022-02-09 01:58:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 01:58:29,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-09 01:58:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:29,955 INFO L225 Difference]: With dead ends: 1101 [2022-02-09 01:58:29,955 INFO L226 Difference]: Without dead ends: 1101 [2022-02-09 01:58:29,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 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-02-09 01:58:29,959 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:29,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-02-09 01:58:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2022-02-09 01:58:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1091 states have (on average 1.9184234647112741) internal successors, (2093), 1100 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 2093 transitions. [2022-02-09 01:58:29,987 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 2093 transitions. Word has length 42 [2022-02-09 01:58:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:29,987 INFO L470 AbstractCegarLoop]: Abstraction has 1101 states and 2093 transitions. [2022-02-09 01:58:29,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 2093 transitions. [2022-02-09 01:58:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-09 01:58:29,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:29,990 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:30,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-09 01:58:30,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:30,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 653292097, now seen corresponding path program 2 times [2022-02-09 01:58:30,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:30,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73729502] [2022-02-09 01:58:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:30,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:30,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:30,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73729502] [2022-02-09 01:58:30,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73729502] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:30,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974235104] [2022-02-09 01:58:30,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:58:30,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:30,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:30,296 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-02-09 01:58:30,297 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-02-09 01:58:30,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 01:58:30,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:58:30,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 01:58:30,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:30,461 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-02-09 01:58:30,488 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-09 01:58:30,488 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-02-09 01:58:30,533 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-02-09 01:58:30,534 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-02-09 01:58:30,595 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-02-09 01:58:30,595 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-02-09 01:58:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-09 01:58:30,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 01:58:30,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974235104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:30,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 01:58:30,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-09 01:58:30,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907248921] [2022-02-09 01:58:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:30,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:30,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-09 01:58:30,624 INFO L87 Difference]: Start difference. First operand 1101 states and 2093 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:30,816 INFO L93 Difference]: Finished difference Result 1384 states and 2630 transitions. [2022-02-09 01:58:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:30,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-09 01:58:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:30,822 INFO L225 Difference]: With dead ends: 1384 [2022-02-09 01:58:30,822 INFO L226 Difference]: Without dead ends: 1384 [2022-02-09 01:58:30,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-09 01:58:30,823 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 136 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:30,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 364 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:58:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-02-09 01:58:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1124. [2022-02-09 01:58:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1116 states have (on average 1.9130824372759856) internal successors, (2135), 1123 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 2135 transitions. [2022-02-09 01:58:30,844 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 2135 transitions. Word has length 52 [2022-02-09 01:58:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:30,844 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 2135 transitions. [2022-02-09 01:58:30,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2135 transitions. [2022-02-09 01:58:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-09 01:58:30,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:30,845 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:30,862 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-02-09 01:58:31,062 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,SelfDestructingSolverStorable3 [2022-02-09 01:58:31,063 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash -406389930, now seen corresponding path program 1 times [2022-02-09 01:58:31,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:31,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454224566] [2022-02-09 01:58:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:31,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:31,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454224566] [2022-02-09 01:58:31,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454224566] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:31,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566820296] [2022-02-09 01:58:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:31,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:31,155 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-02-09 01:58:31,157 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-02-09 01:58:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-09 01:58:31,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:58:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566820296] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:58:31,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:58:31,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-09 01:58:31,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954664409] [2022-02-09 01:58:31,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:58:31,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-09 01:58:31,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-09 01:58:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:31,459 INFO L87 Difference]: Start difference. First operand 1124 states and 2135 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:31,597 INFO L93 Difference]: Finished difference Result 1144 states and 2155 transitions. [2022-02-09 01:58:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 01:58:31,598 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 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 60 [2022-02-09 01:58:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:31,601 INFO L225 Difference]: With dead ends: 1144 [2022-02-09 01:58:31,601 INFO L226 Difference]: Without dead ends: 1144 [2022-02-09 01:58:31,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-02-09 01:58:31,602 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:31,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 550 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-02-09 01:58:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2022-02-09 01:58:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1136 states have (on average 1.8970070422535212) internal successors, (2155), 1143 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2155 transitions. [2022-02-09 01:58:31,620 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2155 transitions. Word has length 60 [2022-02-09 01:58:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:31,620 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 2155 transitions. [2022-02-09 01:58:31,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2155 transitions. [2022-02-09 01:58:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-09 01:58:31,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:31,621 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:31,638 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-02-09 01:58:31,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:31,827 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 232143766, now seen corresponding path program 2 times [2022-02-09 01:58:31,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:31,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83366988] [2022-02-09 01:58:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:31,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:31,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83366988] [2022-02-09 01:58:31,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83366988] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:31,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456398539] [2022-02-09 01:58:31,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:58:31,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:31,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:31,967 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-02-09 01:58:31,968 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-02-09 01:58:32,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 01:58:32,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:58:32,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 01:58:32,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:32,118 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-02-09 01:58:32,143 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-09 01:58:32,144 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-02-09 01:58:32,178 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-02-09 01:58:32,179 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-02-09 01:58:32,228 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-02-09 01:58:32,229 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-02-09 01:58:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-09 01:58:32,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 01:58:32,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456398539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:32,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 01:58:32,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-02-09 01:58:32,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441384156] [2022-02-09 01:58:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:32,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:32,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-02-09 01:58:32,252 INFO L87 Difference]: Start difference. First operand 1144 states and 2155 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:32,458 INFO L93 Difference]: Finished difference Result 1501 states and 2816 transitions. [2022-02-09 01:58:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 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 80 [2022-02-09 01:58:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:32,464 INFO L225 Difference]: With dead ends: 1501 [2022-02-09 01:58:32,464 INFO L226 Difference]: Without dead ends: 1357 [2022-02-09 01:58:32,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 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-02-09 01:58:32,465 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 124 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:32,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 431 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:58:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-02-09 01:58:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1068. [2022-02-09 01:58:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1061 states have (on average 1.878416588124411) internal successors, (1993), 1067 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1993 transitions. [2022-02-09 01:58:32,485 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1993 transitions. Word has length 80 [2022-02-09 01:58:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:32,486 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1993 transitions. [2022-02-09 01:58:32,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1993 transitions. [2022-02-09 01:58:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-09 01:58:32,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:32,487 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:32,507 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-02-09 01:58:32,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:32,699 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -109360466, now seen corresponding path program 1 times [2022-02-09 01:58:32,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:32,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35972665] [2022-02-09 01:58:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:32,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:32,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:32,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35972665] [2022-02-09 01:58:32,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35972665] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:32,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394713039] [2022-02-09 01:58:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:32,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:32,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:32,830 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-02-09 01:58:32,831 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-02-09 01:58:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:32,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-09 01:58:32,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:33,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:58:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:33,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394713039] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:58:33,204 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:58:33,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-09 01:58:33,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935488466] [2022-02-09 01:58:33,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:58:33,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-09 01:58:33,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-09 01:58:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-09 01:58:33,205 INFO L87 Difference]: Start difference. First operand 1068 states and 1993 transitions. Second operand has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 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-02-09 01:58:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:33,419 INFO L93 Difference]: Finished difference Result 1083 states and 2008 transitions. [2022-02-09 01:58:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 01:58:33,420 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 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 81 [2022-02-09 01:58:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:33,423 INFO L225 Difference]: With dead ends: 1083 [2022-02-09 01:58:33,423 INFO L226 Difference]: Without dead ends: 1083 [2022-02-09 01:58:33,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 155 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-02-09 01:58:33,424 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 43 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:33,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 636 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 01:58:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-02-09 01:58:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2022-02-09 01:58:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1076 states have (on average 1.8661710037174721) internal successors, (2008), 1082 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2008 transitions. [2022-02-09 01:58:33,440 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2008 transitions. Word has length 81 [2022-02-09 01:58:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:33,441 INFO L470 AbstractCegarLoop]: Abstraction has 1083 states and 2008 transitions. [2022-02-09 01:58:33,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 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-02-09 01:58:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2008 transitions. [2022-02-09 01:58:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-09 01:58:33,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:33,442 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:33,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-09 01:58:33,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:33,659 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 827906497, now seen corresponding path program 2 times [2022-02-09 01:58:33,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:33,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524968122] [2022-02-09 01:58:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:33,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:33,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:33,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524968122] [2022-02-09 01:58:33,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524968122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:33,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:33,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:58:33,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909401728] [2022-02-09 01:58:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:33,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:33,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:33,759 INFO L87 Difference]: Start difference. First operand 1083 states and 2008 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:33,917 INFO L93 Difference]: Finished difference Result 1504 states and 2821 transitions. [2022-02-09 01:58:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:33,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-02-09 01:58:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:33,922 INFO L225 Difference]: With dead ends: 1504 [2022-02-09 01:58:33,922 INFO L226 Difference]: Without dead ends: 1504 [2022-02-09 01:58:33,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:33,923 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 104 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:33,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 285 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 01:58:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-02-09 01:58:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1124. [2022-02-09 01:58:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1117 states have (on average 1.8675022381378692) internal successors, (2086), 1123 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 2086 transitions. [2022-02-09 01:58:33,943 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 2086 transitions. Word has length 96 [2022-02-09 01:58:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:33,943 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 2086 transitions. [2022-02-09 01:58:33,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2086 transitions. [2022-02-09 01:58:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-09 01:58:33,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:33,945 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:33,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-09 01:58:33,945 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1432249786, now seen corresponding path program 1 times [2022-02-09 01:58:33,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:33,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929392916] [2022-02-09 01:58:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:33,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:34,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:34,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929392916] [2022-02-09 01:58:34,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929392916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:34,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:34,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:58:34,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371366001] [2022-02-09 01:58:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:34,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:34,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:34,017 INFO L87 Difference]: Start difference. First operand 1124 states and 2086 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-02-09 01:58:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:34,226 INFO L93 Difference]: Finished difference Result 1447 states and 2641 transitions. [2022-02-09 01:58:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:34,226 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 104 [2022-02-09 01:58:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:34,230 INFO L225 Difference]: With dead ends: 1447 [2022-02-09 01:58:34,230 INFO L226 Difference]: Without dead ends: 1150 [2022-02-09 01:58:34,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:34,230 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 104 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:34,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 299 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:58:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-02-09 01:58:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 903. [2022-02-09 01:58:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 896 states have (on average 1.8091517857142858) internal successors, (1621), 902 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1621 transitions. [2022-02-09 01:58:34,245 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1621 transitions. Word has length 104 [2022-02-09 01:58:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:34,245 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 1621 transitions. [2022-02-09 01:58:34,246 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-02-09 01:58:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1621 transitions. [2022-02-09 01:58:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:34,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:34,247 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:34,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-09 01:58:34,247 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1475514096, now seen corresponding path program 1 times [2022-02-09 01:58:34,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:34,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144596909] [2022-02-09 01:58:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:34,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:34,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:34,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144596909] [2022-02-09 01:58:34,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144596909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:34,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:34,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:34,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001728904] [2022-02-09 01:58:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:34,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:34,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:34,489 INFO L87 Difference]: Start difference. First operand 903 states and 1621 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:35,155 INFO L93 Difference]: Finished difference Result 1176 states and 2069 transitions. [2022-02-09 01:58:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:58:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:35,159 INFO L225 Difference]: With dead ends: 1176 [2022-02-09 01:58:35,159 INFO L226 Difference]: Without dead ends: 1135 [2022-02-09 01:58:35,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-02-09 01:58:35,160 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 268 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:35,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 635 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:58:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-02-09 01:58:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 898. [2022-02-09 01:58:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 891 states have (on average 1.8159371492704826) internal successors, (1618), 897 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1618 transitions. [2022-02-09 01:58:35,188 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1618 transitions. Word has length 110 [2022-02-09 01:58:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:35,188 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 1618 transitions. [2022-02-09 01:58:35,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1618 transitions. [2022-02-09 01:58:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:35,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:35,190 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:35,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-09 01:58:35,190 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1432498022, now seen corresponding path program 2 times [2022-02-09 01:58:35,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:35,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057385233] [2022-02-09 01:58:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:35,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:35,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:35,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057385233] [2022-02-09 01:58:35,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057385233] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:35,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:35,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:35,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901695547] [2022-02-09 01:58:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:35,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:35,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:35,476 INFO L87 Difference]: Start difference. First operand 898 states and 1618 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:36,361 INFO L93 Difference]: Finished difference Result 1263 states and 2237 transitions. [2022-02-09 01:58:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:58:36,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:36,365 INFO L225 Difference]: With dead ends: 1263 [2022-02-09 01:58:36,366 INFO L226 Difference]: Without dead ends: 1233 [2022-02-09 01:58:36,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-02-09 01:58:36,366 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 218 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:36,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 789 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:58:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-02-09 01:58:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 909. [2022-02-09 01:58:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 902 states have (on average 1.8148558758314857) internal successors, (1637), 908 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1637 transitions. [2022-02-09 01:58:36,383 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1637 transitions. Word has length 110 [2022-02-09 01:58:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:36,383 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1637 transitions. [2022-02-09 01:58:36,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1637 transitions. [2022-02-09 01:58:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:36,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:36,385 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:36,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-09 01:58:36,385 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -590607614, now seen corresponding path program 3 times [2022-02-09 01:58:36,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:36,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784521940] [2022-02-09 01:58:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:36,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:36,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:36,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784521940] [2022-02-09 01:58:36,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784521940] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:36,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:36,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:36,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902054474] [2022-02-09 01:58:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:36,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:36,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:36,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:36,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:36,665 INFO L87 Difference]: Start difference. First operand 909 states and 1637 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:37,302 INFO L93 Difference]: Finished difference Result 1211 states and 2159 transitions. [2022-02-09 01:58:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:58:37,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:37,306 INFO L225 Difference]: With dead ends: 1211 [2022-02-09 01:58:37,306 INFO L226 Difference]: Without dead ends: 1182 [2022-02-09 01:58:37,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:37,307 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 214 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:37,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 657 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:58:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-02-09 01:58:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 925. [2022-02-09 01:58:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 918 states have (on average 1.8028322440087146) internal successors, (1655), 924 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1655 transitions. [2022-02-09 01:58:37,323 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1655 transitions. Word has length 110 [2022-02-09 01:58:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:37,323 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1655 transitions. [2022-02-09 01:58:37,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1655 transitions. [2022-02-09 01:58:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:37,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:37,325 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:37,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-09 01:58:37,325 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash -822391322, now seen corresponding path program 4 times [2022-02-09 01:58:37,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:37,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027325228] [2022-02-09 01:58:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:37,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:37,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:37,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027325228] [2022-02-09 01:58:37,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027325228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:37,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:37,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:37,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276259429] [2022-02-09 01:58:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:37,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:37,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:37,631 INFO L87 Difference]: Start difference. First operand 925 states and 1655 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:38,579 INFO L93 Difference]: Finished difference Result 1284 states and 2285 transitions. [2022-02-09 01:58:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:58:38,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:38,583 INFO L225 Difference]: With dead ends: 1284 [2022-02-09 01:58:38,583 INFO L226 Difference]: Without dead ends: 1261 [2022-02-09 01:58:38,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2022-02-09 01:58:38,584 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 192 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:38,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 722 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:58:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-02-09 01:58:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 927. [2022-02-09 01:58:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 920 states have (on average 1.8021739130434782) internal successors, (1658), 926 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1658 transitions. [2022-02-09 01:58:38,600 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1658 transitions. Word has length 110 [2022-02-09 01:58:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:38,600 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1658 transitions. [2022-02-09 01:58:38,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1658 transitions. [2022-02-09 01:58:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:38,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:38,602 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:38,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-09 01:58:38,602 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1449470338, now seen corresponding path program 5 times [2022-02-09 01:58:38,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:38,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867138785] [2022-02-09 01:58:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:38,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:38,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:38,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867138785] [2022-02-09 01:58:38,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867138785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:38,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:38,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:38,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492779996] [2022-02-09 01:58:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:38,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:38,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:38,849 INFO L87 Difference]: Start difference. First operand 927 states and 1658 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:39,643 INFO L93 Difference]: Finished difference Result 1321 states and 2352 transitions. [2022-02-09 01:58:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:58:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:39,647 INFO L225 Difference]: With dead ends: 1321 [2022-02-09 01:58:39,647 INFO L226 Difference]: Without dead ends: 1292 [2022-02-09 01:58:39,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2022-02-09 01:58:39,648 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 219 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:39,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 650 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:58:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-02-09 01:58:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 926. [2022-02-09 01:58:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 919 states have (on average 1.8030467899891187) internal successors, (1657), 925 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1657 transitions. [2022-02-09 01:58:39,662 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1657 transitions. Word has length 110 [2022-02-09 01:58:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:39,662 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1657 transitions. [2022-02-09 01:58:39,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1657 transitions. [2022-02-09 01:58:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:39,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:39,663 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:39,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-09 01:58:39,664 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash -280766288, now seen corresponding path program 6 times [2022-02-09 01:58:39,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:39,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374880529] [2022-02-09 01:58:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:39,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:39,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:39,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374880529] [2022-02-09 01:58:39,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374880529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:39,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:39,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:39,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926697443] [2022-02-09 01:58:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:39,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:39,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:39,847 INFO L87 Difference]: Start difference. First operand 926 states and 1657 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:40,422 INFO L93 Difference]: Finished difference Result 1235 states and 2211 transitions. [2022-02-09 01:58:40,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:58:40,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:40,426 INFO L225 Difference]: With dead ends: 1235 [2022-02-09 01:58:40,426 INFO L226 Difference]: Without dead ends: 1199 [2022-02-09 01:58:40,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:40,427 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 185 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:40,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 743 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:58:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2022-02-09 01:58:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 946. [2022-02-09 01:58:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 939 states have (on average 1.807241746538871) internal successors, (1697), 945 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1697 transitions. [2022-02-09 01:58:40,452 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1697 transitions. Word has length 110 [2022-02-09 01:58:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:40,452 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 1697 transitions. [2022-02-09 01:58:40,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1697 transitions. [2022-02-09 01:58:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:40,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:40,453 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:40,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-09 01:58:40,453 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1073377992, now seen corresponding path program 7 times [2022-02-09 01:58:40,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:40,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872141695] [2022-02-09 01:58:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:40,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:40,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:40,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872141695] [2022-02-09 01:58:40,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872141695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:40,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:40,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:40,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116973048] [2022-02-09 01:58:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:40,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:40,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:40,752 INFO L87 Difference]: Start difference. First operand 946 states and 1697 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:41,690 INFO L93 Difference]: Finished difference Result 1232 states and 2196 transitions. [2022-02-09 01:58:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:58:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:41,693 INFO L225 Difference]: With dead ends: 1232 [2022-02-09 01:58:41,694 INFO L226 Difference]: Without dead ends: 1209 [2022-02-09 01:58:41,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-02-09 01:58:41,695 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 188 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:41,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 713 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:58:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-02-09 01:58:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 949. [2022-02-09 01:58:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 942 states have (on average 1.8067940552016986) internal successors, (1702), 948 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1702 transitions. [2022-02-09 01:58:41,737 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1702 transitions. Word has length 110 [2022-02-09 01:58:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:41,738 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1702 transitions. [2022-02-09 01:58:41,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1702 transitions. [2022-02-09 01:58:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:41,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:41,739 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:41,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-09 01:58:41,739 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1198483668, now seen corresponding path program 8 times [2022-02-09 01:58:41,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:41,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744292494] [2022-02-09 01:58:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:41,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:42,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:42,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744292494] [2022-02-09 01:58:42,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744292494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:42,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:42,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:42,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298595662] [2022-02-09 01:58:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:42,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:42,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:42,007 INFO L87 Difference]: Start difference. First operand 949 states and 1702 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:42,787 INFO L93 Difference]: Finished difference Result 1269 states and 2263 transitions. [2022-02-09 01:58:42,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:58:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:42,791 INFO L225 Difference]: With dead ends: 1269 [2022-02-09 01:58:42,791 INFO L226 Difference]: Without dead ends: 1240 [2022-02-09 01:58:42,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2022-02-09 01:58:42,792 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 214 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:42,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 644 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:58:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-02-09 01:58:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 948. [2022-02-09 01:58:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 941 states have (on average 1.8076514346439958) internal successors, (1701), 947 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1701 transitions. [2022-02-09 01:58:42,807 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1701 transitions. Word has length 110 [2022-02-09 01:58:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:42,808 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1701 transitions. [2022-02-09 01:58:42,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1701 transitions. [2022-02-09 01:58:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:42,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:42,809 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:42,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-09 01:58:42,809 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -531752958, now seen corresponding path program 9 times [2022-02-09 01:58:42,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:42,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945206008] [2022-02-09 01:58:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:42,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:43,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:43,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945206008] [2022-02-09 01:58:43,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945206008] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:43,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:43,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:43,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049799743] [2022-02-09 01:58:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:43,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:43,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:43,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:43,039 INFO L87 Difference]: Start difference. First operand 948 states and 1701 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:43,704 INFO L93 Difference]: Finished difference Result 1324 states and 2356 transitions. [2022-02-09 01:58:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:58:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:43,708 INFO L225 Difference]: With dead ends: 1324 [2022-02-09 01:58:43,708 INFO L226 Difference]: Without dead ends: 1288 [2022-02-09 01:58:43,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-02-09 01:58:43,709 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 215 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:43,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 569 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:58:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2022-02-09 01:58:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 947. [2022-02-09 01:58:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 940 states have (on average 1.8074468085106383) internal successors, (1699), 946 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1699 transitions. [2022-02-09 01:58:43,723 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1699 transitions. Word has length 110 [2022-02-09 01:58:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:43,723 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1699 transitions. [2022-02-09 01:58:43,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1699 transitions. [2022-02-09 01:58:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:43,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:43,725 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:43,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-09 01:58:43,725 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash -26692798, now seen corresponding path program 10 times [2022-02-09 01:58:43,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:43,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736520264] [2022-02-09 01:58:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:43,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:43,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:43,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736520264] [2022-02-09 01:58:43,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736520264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:43,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:43,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:43,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170183366] [2022-02-09 01:58:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:43,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:43,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:43,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:43,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:43,903 INFO L87 Difference]: Start difference. First operand 947 states and 1699 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:44,359 INFO L93 Difference]: Finished difference Result 1177 states and 2109 transitions. [2022-02-09 01:58:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:58:44,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:44,362 INFO L225 Difference]: With dead ends: 1177 [2022-02-09 01:58:44,362 INFO L226 Difference]: Without dead ends: 1134 [2022-02-09 01:58:44,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:44,362 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 172 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:44,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 566 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:58:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-02-09 01:58:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 971. [2022-02-09 01:58:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 964 states have (on average 1.812240663900415) internal successors, (1747), 970 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1747 transitions. [2022-02-09 01:58:44,389 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1747 transitions. Word has length 110 [2022-02-09 01:58:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:44,389 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 1747 transitions. [2022-02-09 01:58:44,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1747 transitions. [2022-02-09 01:58:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:44,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:44,391 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:44,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-09 01:58:44,391 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 18344714, now seen corresponding path program 11 times [2022-02-09 01:58:44,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:44,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080859437] [2022-02-09 01:58:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:44,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:44,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:44,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080859437] [2022-02-09 01:58:44,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080859437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:44,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:44,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:44,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579926710] [2022-02-09 01:58:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:44,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:44,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:44,558 INFO L87 Difference]: Start difference. First operand 971 states and 1747 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:44,958 INFO L93 Difference]: Finished difference Result 1712 states and 3095 transitions. [2022-02-09 01:58:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:58:44,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:44,961 INFO L225 Difference]: With dead ends: 1712 [2022-02-09 01:58:44,961 INFO L226 Difference]: Without dead ends: 1661 [2022-02-09 01:58:44,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:44,962 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 368 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:44,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 450 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 01:58:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-02-09 01:58:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1179. [2022-02-09 01:58:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1172 states have (on average 1.8506825938566553) internal successors, (2169), 1178 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 2169 transitions. [2022-02-09 01:58:44,990 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 2169 transitions. Word has length 110 [2022-02-09 01:58:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:44,990 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 2169 transitions. [2022-02-09 01:58:44,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2169 transitions. [2022-02-09 01:58:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:44,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:44,992 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:44,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-09 01:58:44,992 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -724763226, now seen corresponding path program 1 times [2022-02-09 01:58:44,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:44,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948848552] [2022-02-09 01:58:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:44,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:45,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:45,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948848552] [2022-02-09 01:58:45,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948848552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:45,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:45,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:45,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195338984] [2022-02-09 01:58:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:45,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:45,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:45,159 INFO L87 Difference]: Start difference. First operand 1179 states and 2169 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:45,586 INFO L93 Difference]: Finished difference Result 1533 states and 2770 transitions. [2022-02-09 01:58:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 01:58:45,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:45,589 INFO L225 Difference]: With dead ends: 1533 [2022-02-09 01:58:45,589 INFO L226 Difference]: Without dead ends: 1485 [2022-02-09 01:58:45,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:45,590 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 350 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:45,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 535 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 01:58:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-02-09 01:58:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1187. [2022-02-09 01:58:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1180 states have (on average 1.8483050847457627) internal successors, (2181), 1186 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2181 transitions. [2022-02-09 01:58:45,606 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2181 transitions. Word has length 110 [2022-02-09 01:58:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:45,606 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 2181 transitions. [2022-02-09 01:58:45,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2181 transitions. [2022-02-09 01:58:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:45,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:45,608 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:45,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-09 01:58:45,608 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2136923978, now seen corresponding path program 12 times [2022-02-09 01:58:45,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:45,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270540227] [2022-02-09 01:58:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:45,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:45,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:45,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270540227] [2022-02-09 01:58:45,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270540227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:45,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:45,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:45,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562808990] [2022-02-09 01:58:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:45,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:45,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:45,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:45,905 INFO L87 Difference]: Start difference. First operand 1187 states and 2181 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:46,553 INFO L93 Difference]: Finished difference Result 1479 states and 2661 transitions. [2022-02-09 01:58:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 01:58:46,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:46,556 INFO L225 Difference]: With dead ends: 1479 [2022-02-09 01:58:46,556 INFO L226 Difference]: Without dead ends: 1456 [2022-02-09 01:58:46,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2022-02-09 01:58:46,557 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 180 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:46,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 645 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:58:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-02-09 01:58:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1187. [2022-02-09 01:58:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1180 states have (on average 1.847457627118644) internal successors, (2180), 1186 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2180 transitions. [2022-02-09 01:58:46,573 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2180 transitions. Word has length 110 [2022-02-09 01:58:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:46,573 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 2180 transitions. [2022-02-09 01:58:46,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2180 transitions. [2022-02-09 01:58:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:46,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:46,574 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:46,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-09 01:58:46,574 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash 113818342, now seen corresponding path program 13 times [2022-02-09 01:58:46,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:46,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902598523] [2022-02-09 01:58:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:46,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:46,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:46,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902598523] [2022-02-09 01:58:46,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902598523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:46,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:46,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:46,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339647409] [2022-02-09 01:58:46,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:46,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:46,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:46,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:46,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:46,823 INFO L87 Difference]: Start difference. First operand 1187 states and 2180 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:47,350 INFO L93 Difference]: Finished difference Result 1508 states and 2715 transitions. [2022-02-09 01:58:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 01:58:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:47,353 INFO L225 Difference]: With dead ends: 1508 [2022-02-09 01:58:47,353 INFO L226 Difference]: Without dead ends: 1479 [2022-02-09 01:58:47,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-09 01:58:47,354 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 208 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:47,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 489 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:58:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2022-02-09 01:58:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1186. [2022-02-09 01:58:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1179 states have (on average 1.8481764206955047) internal successors, (2179), 1185 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2179 transitions. [2022-02-09 01:58:47,370 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2179 transitions. Word has length 110 [2022-02-09 01:58:47,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:47,370 INFO L470 AbstractCegarLoop]: Abstraction has 1186 states and 2179 transitions. [2022-02-09 01:58:47,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2179 transitions. [2022-02-09 01:58:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:47,372 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:47,372 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:47,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-09 01:58:47,372 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1616418284, now seen corresponding path program 14 times [2022-02-09 01:58:47,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:47,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206600739] [2022-02-09 01:58:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:47,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:47,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:47,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206600739] [2022-02-09 01:58:47,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206600739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:47,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:47,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:47,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432808656] [2022-02-09 01:58:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:47,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:47,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:47,605 INFO L87 Difference]: Start difference. First operand 1186 states and 2179 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:48,087 INFO L93 Difference]: Finished difference Result 1554 states and 2790 transitions. [2022-02-09 01:58:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 01:58:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:48,090 INFO L225 Difference]: With dead ends: 1554 [2022-02-09 01:58:48,090 INFO L226 Difference]: Without dead ends: 1518 [2022-02-09 01:58:48,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-02-09 01:58:48,091 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 271 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:48,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 448 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:58:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2022-02-09 01:58:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1185. [2022-02-09 01:58:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1178 states have (on average 1.8480475382003396) internal successors, (2177), 1184 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2177 transitions. [2022-02-09 01:58:48,106 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2177 transitions. Word has length 110 [2022-02-09 01:58:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:48,107 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 2177 transitions. [2022-02-09 01:58:48,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2177 transitions. [2022-02-09 01:58:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:48,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:48,108 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:48,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-09 01:58:48,108 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1111358124, now seen corresponding path program 15 times [2022-02-09 01:58:48,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:48,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290091388] [2022-02-09 01:58:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:48,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:48,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:48,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290091388] [2022-02-09 01:58:48,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290091388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:48,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:48,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 01:58:48,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070692187] [2022-02-09 01:58:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:48,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:58:48,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:58:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:58:48,305 INFO L87 Difference]: Start difference. First operand 1185 states and 2177 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:48,774 INFO L93 Difference]: Finished difference Result 1496 states and 2690 transitions. [2022-02-09 01:58:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:58:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 01:58:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:48,777 INFO L225 Difference]: With dead ends: 1496 [2022-02-09 01:58:48,777 INFO L226 Difference]: Without dead ends: 1453 [2022-02-09 01:58:48,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2022-02-09 01:58:48,777 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 247 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:48,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 517 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:58:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-02-09 01:58:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1163. [2022-02-09 01:58:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1156 states have (on average 1.8451557093425606) internal successors, (2133), 1162 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2133 transitions. [2022-02-09 01:58:48,792 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2133 transitions. Word has length 110 [2022-02-09 01:58:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:48,793 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 2133 transitions. [2022-02-09 01:58:48,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:58:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2133 transitions. [2022-02-09 01:58:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:58:48,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:48,794 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 01:58:48,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-09 01:58:48,794 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash -347285014, now seen corresponding path program 1 times [2022-02-09 01:58:48,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:48,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031496575] [2022-02-09 01:58:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:48,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:06:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 02:06:40,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:06:40,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031496575] [2022-02-09 02:06:40,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031496575] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 02:06:40,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584035550] [2022-02-09 02:06:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:06:40,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 02:06:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 02:06:40,071 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-02-09 02:06:40,072 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-02-09 02:06:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:06:40,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 75 conjunts are in the unsatisfiable core [2022-02-09 02:06:40,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 02:06:40,476 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 16 treesize of output 12 [2022-02-09 02:06:40,512 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-02-09 02:06:40,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,555 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-02-09 02:06:40,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,605 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 0 case distinctions, treesize of input 40 treesize of output 42 [2022-02-09 02:06:40,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:06:40,662 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 0 case distinctions, treesize of input 52 treesize of output 57 [2022-02-09 02:06:40,904 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-02-09 02:06:40,905 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 25 treesize of output 15 [2022-02-09 02:06:40,966 INFO L353 Elim1Store]: treesize reduction 258, result has 15.7 percent of original size [2022-02-09 02:06:40,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 71 [2022-02-09 02:06:41,022 INFO L353 Elim1Store]: treesize reduction 266, result has 15.3 percent of original size [2022-02-09 02:06:41,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2022-02-09 02:06:41,069 INFO L353 Elim1Store]: treesize reduction 266, result has 15.3 percent of original size [2022-02-09 02:06:41,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2022-02-09 02:06:41,112 INFO L353 Elim1Store]: treesize reduction 266, result has 15.3 percent of original size [2022-02-09 02:06:41,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2022-02-09 02:06:41,361 INFO L353 Elim1Store]: treesize reduction 642, result has 11.6 percent of original size [2022-02-09 02:06:41,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 116 [2022-02-09 02:06:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-09 02:06:46,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 02:06:47,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-02-09 02:06:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:06:47,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584035550] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-09 02:06:47,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-09 02:06:47,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [34, 25] total 51 [2022-02-09 02:06:47,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528467293] [2022-02-09 02:06:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:06:47,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-09 02:06:47,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:06:47,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-09 02:06:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2418, Unknown=7, NotChecked=0, Total=2652 [2022-02-09 02:06:47,773 INFO L87 Difference]: Start difference. First operand 1163 states and 2133 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:06:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:06:48,561 INFO L93 Difference]: Finished difference Result 1935 states and 3609 transitions. [2022-02-09 02:06:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 02:06:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:06:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:06:48,564 INFO L225 Difference]: With dead ends: 1935 [2022-02-09 02:06:48,564 INFO L226 Difference]: Without dead ends: 1928 [2022-02-09 02:06:48,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 197 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=249, Invalid=2713, Unknown=8, NotChecked=0, Total=2970 [2022-02-09 02:06:48,565 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 149 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:06:48,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 726 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 261 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2022-02-09 02:06:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-02-09 02:06:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1179. [2022-02-09 02:06:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1172 states have (on average 1.8464163822525597) internal successors, (2164), 1178 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:06:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 2164 transitions. [2022-02-09 02:06:48,581 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 2164 transitions. Word has length 110 [2022-02-09 02:06:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:06:48,581 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 2164 transitions. [2022-02-09 02:06:48,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:06:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2164 transitions. [2022-02-09 02:06:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:06:48,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:06:48,582 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:06:48,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-09 02:06:48,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-09 02:06:48,801 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:06:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:06:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1081675656, now seen corresponding path program 2 times [2022-02-09 02:06:48,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:06:48,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623703811] [2022-02-09 02:06:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:06:48,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:06:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:10:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 02:10:54,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:10:54,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623703811] [2022-02-09 02:10:54,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623703811] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 02:10:54,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857088395] [2022-02-09 02:10:54,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 02:10:54,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 02:10:54,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 02:10:54,233 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-02-09 02:10:54,234 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-02-09 02:10:54,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 02:10:54,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 02:10:54,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 45 conjunts are in the unsatisfiable core [2022-02-09 02:10:54,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 02:10:54,432 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 16 treesize of output 12 [2022-02-09 02:10:54,456 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-02-09 02:10:54,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,485 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-02-09 02:10:54,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,518 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 0 case distinctions, treesize of input 40 treesize of output 42 [2022-02-09 02:10:54,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 02:10:54,694 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 0 case distinctions, treesize of input 52 treesize of output 57 [2022-02-09 02:10:54,752 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-02-09 02:10:54,752 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 25 treesize of output 15 [2022-02-09 02:10:54,850 INFO L353 Elim1Store]: treesize reduction 258, result has 15.7 percent of original size [2022-02-09 02:10:54,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 71 [2022-02-09 02:10:54,894 INFO L353 Elim1Store]: treesize reduction 266, result has 15.3 percent of original size [2022-02-09 02:10:54,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2022-02-09 02:10:54,942 INFO L353 Elim1Store]: treesize reduction 266, result has 15.3 percent of original size [2022-02-09 02:10:54,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2022-02-09 02:10:54,994 INFO L353 Elim1Store]: treesize reduction 266, result has 15.3 percent of original size [2022-02-09 02:10:54,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 72 [2022-02-09 02:10:55,258 INFO L353 Elim1Store]: treesize reduction 642, result has 11.6 percent of original size [2022-02-09 02:10:55,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 116 [2022-02-09 02:10:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:10:59,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 02:10:59,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857088395] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:10:59,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 02:10:59,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [33] total 43 [2022-02-09 02:10:59,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489614939] [2022-02-09 02:10:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:10:59,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-09 02:10:59,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:10:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-09 02:10:59,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1736, Unknown=6, NotChecked=0, Total=1892 [2022-02-09 02:10:59,661 INFO L87 Difference]: Start difference. First operand 1179 states and 2164 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:01,487 INFO L93 Difference]: Finished difference Result 1554 states and 2873 transitions. [2022-02-09 02:11:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 02:11:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:01,490 INFO L225 Difference]: With dead ends: 1554 [2022-02-09 02:11:01,490 INFO L226 Difference]: Without dead ends: 1547 [2022-02-09 02:11:01,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=184, Invalid=1970, Unknown=8, NotChecked=0, Total=2162 [2022-02-09 02:11:01,491 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 197 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:01,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 702 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 566 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2022-02-09 02:11:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-02-09 02:11:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1180. [2022-02-09 02:11:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1173 states have (on average 1.8465473145780051) internal successors, (2166), 1179 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2166 transitions. [2022-02-09 02:11:01,506 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2166 transitions. Word has length 110 [2022-02-09 02:11:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:01,506 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 2166 transitions. [2022-02-09 02:11:01,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2166 transitions. [2022-02-09 02:11:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:01,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:01,507 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:01,539 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-02-09 02:11:01,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 02:11:01,719 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1609696764, now seen corresponding path program 3 times [2022-02-09 02:11:01,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:01,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200176403] [2022-02-09 02:11:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:01,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:01,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:01,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200176403] [2022-02-09 02:11:01,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200176403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:01,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:01,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:01,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226139252] [2022-02-09 02:11:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:01,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:01,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:01,989 INFO L87 Difference]: Start difference. First operand 1180 states and 2166 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:02,596 INFO L93 Difference]: Finished difference Result 1532 states and 2813 transitions. [2022-02-09 02:11:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 02:11:02,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:02,599 INFO L225 Difference]: With dead ends: 1532 [2022-02-09 02:11:02,599 INFO L226 Difference]: Without dead ends: 1511 [2022-02-09 02:11:02,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:02,599 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 239 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:02,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 670 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-02-09 02:11:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1204. [2022-02-09 02:11:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1197 states have (on average 1.846282372598162) internal successors, (2210), 1203 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2210 transitions. [2022-02-09 02:11:02,613 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 2210 transitions. Word has length 110 [2022-02-09 02:11:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:02,613 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 2210 transitions. [2022-02-09 02:11:02,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 2210 transitions. [2022-02-09 02:11:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:02,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:02,615 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:02,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-09 02:11:02,615 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1066179186, now seen corresponding path program 4 times [2022-02-09 02:11:02,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:02,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939202900] [2022-02-09 02:11:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:02,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:02,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:02,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939202900] [2022-02-09 02:11:02,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939202900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:02,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:02,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:02,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544869893] [2022-02-09 02:11:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:02,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:02,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:02,922 INFO L87 Difference]: Start difference. First operand 1204 states and 2210 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:03,829 INFO L93 Difference]: Finished difference Result 1690 states and 3120 transitions. [2022-02-09 02:11:03,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-09 02:11:03,829 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:03,832 INFO L225 Difference]: With dead ends: 1690 [2022-02-09 02:11:03,832 INFO L226 Difference]: Without dead ends: 1683 [2022-02-09 02:11:03,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2022-02-09 02:11:03,832 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 265 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:03,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 661 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 02:11:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-02-09 02:11:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1206. [2022-02-09 02:11:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1199 states have (on average 1.8465387823185988) internal successors, (2214), 1205 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2214 transitions. [2022-02-09 02:11:03,847 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2214 transitions. Word has length 110 [2022-02-09 02:11:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:03,847 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 2214 transitions. [2022-02-09 02:11:03,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2214 transitions. [2022-02-09 02:11:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:03,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:03,849 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:03,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-09 02:11:03,849 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -538158078, now seen corresponding path program 5 times [2022-02-09 02:11:03,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:03,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199398106] [2022-02-09 02:11:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:03,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:04,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:04,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199398106] [2022-02-09 02:11:04,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199398106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:04,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:04,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:04,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874284506] [2022-02-09 02:11:04,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:04,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:04,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:04,122 INFO L87 Difference]: Start difference. First operand 1206 states and 2214 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:04,964 INFO L93 Difference]: Finished difference Result 1733 states and 3200 transitions. [2022-02-09 02:11:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-09 02:11:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:04,967 INFO L225 Difference]: With dead ends: 1733 [2022-02-09 02:11:04,967 INFO L226 Difference]: Without dead ends: 1719 [2022-02-09 02:11:04,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2022-02-09 02:11:04,968 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 234 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:04,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 751 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 02:11:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2022-02-09 02:11:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1205. [2022-02-09 02:11:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1198 states have (on average 1.8464106844741235) internal successors, (2212), 1204 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2212 transitions. [2022-02-09 02:11:04,985 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2212 transitions. Word has length 110 [2022-02-09 02:11:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:04,985 INFO L470 AbstractCegarLoop]: Abstraction has 1205 states and 2212 transitions. [2022-02-09 02:11:04,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2212 transitions. [2022-02-09 02:11:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:04,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:04,987 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:04,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-09 02:11:04,987 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1059393834, now seen corresponding path program 6 times [2022-02-09 02:11:04,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:04,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413926498] [2022-02-09 02:11:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:04,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:05,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:05,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413926498] [2022-02-09 02:11:05,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413926498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:05,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:05,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:05,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904832402] [2022-02-09 02:11:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:05,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:05,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:05,255 INFO L87 Difference]: Start difference. First operand 1205 states and 2212 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:05,783 INFO L93 Difference]: Finished difference Result 1556 states and 2874 transitions. [2022-02-09 02:11:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 02:11:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:05,785 INFO L225 Difference]: With dead ends: 1556 [2022-02-09 02:11:05,785 INFO L226 Difference]: Without dead ends: 1535 [2022-02-09 02:11:05,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:05,786 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 217 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:05,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 619 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2022-02-09 02:11:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1222. [2022-02-09 02:11:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1215 states have (on average 1.8477366255144032) internal successors, (2245), 1221 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2245 transitions. [2022-02-09 02:11:05,800 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2245 transitions. Word has length 110 [2022-02-09 02:11:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:05,800 INFO L470 AbstractCegarLoop]: Abstraction has 1222 states and 2245 transitions. [2022-02-09 02:11:05,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2245 transitions. [2022-02-09 02:11:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:05,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:05,801 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:05,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-09 02:11:05,801 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash 841263638, now seen corresponding path program 7 times [2022-02-09 02:11:05,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:05,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751118079] [2022-02-09 02:11:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:05,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:06,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:06,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751118079] [2022-02-09 02:11:06,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751118079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:06,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:06,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:06,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503622234] [2022-02-09 02:11:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:06,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:06,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:06,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:06,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:06,112 INFO L87 Difference]: Start difference. First operand 1222 states and 2245 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:06,919 INFO L93 Difference]: Finished difference Result 1646 states and 3041 transitions. [2022-02-09 02:11:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 02:11:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:06,921 INFO L225 Difference]: With dead ends: 1646 [2022-02-09 02:11:06,921 INFO L226 Difference]: Without dead ends: 1639 [2022-02-09 02:11:06,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-02-09 02:11:06,922 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 237 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:06,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 584 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 02:11:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2022-02-09 02:11:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1225. [2022-02-09 02:11:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1218 states have (on average 1.848111658456486) internal successors, (2251), 1224 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2251 transitions. [2022-02-09 02:11:06,935 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2251 transitions. Word has length 110 [2022-02-09 02:11:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:06,936 INFO L470 AbstractCegarLoop]: Abstraction has 1225 states and 2251 transitions. [2022-02-09 02:11:06,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2251 transitions. [2022-02-09 02:11:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:06,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:06,937 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:06,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-09 02:11:06,937 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1369284746, now seen corresponding path program 8 times [2022-02-09 02:11:06,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:06,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661979898] [2022-02-09 02:11:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:06,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:07,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:07,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661979898] [2022-02-09 02:11:07,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661979898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:07,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:07,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:07,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134267419] [2022-02-09 02:11:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:07,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:07,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:07,234 INFO L87 Difference]: Start difference. First operand 1225 states and 2251 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:07,927 INFO L93 Difference]: Finished difference Result 1689 states and 3121 transitions. [2022-02-09 02:11:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 02:11:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:07,930 INFO L225 Difference]: With dead ends: 1689 [2022-02-09 02:11:07,930 INFO L226 Difference]: Without dead ends: 1675 [2022-02-09 02:11:07,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2022-02-09 02:11:07,930 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 258 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:07,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 555 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-02-09 02:11:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1224. [2022-02-09 02:11:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1217 states have (on average 1.8479868529170091) internal successors, (2249), 1223 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 2249 transitions. [2022-02-09 02:11:07,952 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 2249 transitions. Word has length 110 [2022-02-09 02:11:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:07,952 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 2249 transitions. [2022-02-09 02:11:07,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 2249 transitions. [2022-02-09 02:11:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:07,953 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:07,954 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:07,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-09 02:11:07,954 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1328130638, now seen corresponding path program 9 times [2022-02-09 02:11:07,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:07,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132388402] [2022-02-09 02:11:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:07,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:08,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:08,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132388402] [2022-02-09 02:11:08,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132388402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:08,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:08,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:08,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820385824] [2022-02-09 02:11:08,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:08,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:08,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:08,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:08,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:08,254 INFO L87 Difference]: Start difference. First operand 1224 states and 2249 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:08,964 INFO L93 Difference]: Finished difference Result 1736 states and 3212 transitions. [2022-02-09 02:11:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 02:11:08,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:08,967 INFO L225 Difference]: With dead ends: 1736 [2022-02-09 02:11:08,967 INFO L226 Difference]: Without dead ends: 1715 [2022-02-09 02:11:08,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-02-09 02:11:08,967 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 259 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:08,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 620 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 02:11:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2022-02-09 02:11:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1223. [2022-02-09 02:11:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1216 states have (on average 1.847861842105263) internal successors, (2247), 1222 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2247 transitions. [2022-02-09 02:11:08,981 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2247 transitions. Word has length 110 [2022-02-09 02:11:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:08,981 INFO L470 AbstractCegarLoop]: Abstraction has 1223 states and 2247 transitions. [2022-02-09 02:11:08,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2247 transitions. [2022-02-09 02:11:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:08,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:08,983 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:08,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-09 02:11:08,983 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2088485180, now seen corresponding path program 10 times [2022-02-09 02:11:08,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:08,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433550323] [2022-02-09 02:11:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:08,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:09,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:09,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433550323] [2022-02-09 02:11:09,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433550323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:09,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:09,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:09,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380515976] [2022-02-09 02:11:09,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:09,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:09,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:09,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:09,247 INFO L87 Difference]: Start difference. First operand 1223 states and 2247 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:09,778 INFO L93 Difference]: Finished difference Result 1517 states and 2800 transitions. [2022-02-09 02:11:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 02:11:09,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:09,781 INFO L225 Difference]: With dead ends: 1517 [2022-02-09 02:11:09,781 INFO L226 Difference]: Without dead ends: 1489 [2022-02-09 02:11:09,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:09,781 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 220 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:09,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 584 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-02-09 02:11:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1242. [2022-02-09 02:11:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1235 states have (on average 1.8493927125506073) internal successors, (2284), 1241 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2284 transitions. [2022-02-09 02:11:09,795 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2284 transitions. Word has length 110 [2022-02-09 02:11:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:09,796 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 2284 transitions. [2022-02-09 02:11:09,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2284 transitions. [2022-02-09 02:11:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:09,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:09,797 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:09,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-09 02:11:09,797 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 330556564, now seen corresponding path program 11 times [2022-02-09 02:11:09,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:09,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681059299] [2022-02-09 02:11:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:09,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:10,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:10,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681059299] [2022-02-09 02:11:10,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681059299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:10,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:10,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:10,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025042697] [2022-02-09 02:11:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:10,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:10,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:10,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:10,264 INFO L87 Difference]: Start difference. First operand 1242 states and 2284 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:10,796 INFO L93 Difference]: Finished difference Result 1492 states and 2718 transitions. [2022-02-09 02:11:10,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 02:11:10,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:10,798 INFO L225 Difference]: With dead ends: 1492 [2022-02-09 02:11:10,798 INFO L226 Difference]: Without dead ends: 1485 [2022-02-09 02:11:10,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:10,798 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 248 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:10,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 447 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-02-09 02:11:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1241. [2022-02-09 02:11:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1234 states have (on average 1.8492706645056727) internal successors, (2282), 1240 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2282 transitions. [2022-02-09 02:11:10,810 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2282 transitions. Word has length 110 [2022-02-09 02:11:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:10,810 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 2282 transitions. [2022-02-09 02:11:10,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2282 transitions. [2022-02-09 02:11:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:10,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:10,811 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:10,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-09 02:11:10,812 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 858577672, now seen corresponding path program 12 times [2022-02-09 02:11:10,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:10,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784422791] [2022-02-09 02:11:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:10,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:11,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:11,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784422791] [2022-02-09 02:11:11,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784422791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:11,168 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:11,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:11,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058769236] [2022-02-09 02:11:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:11,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:11,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:11,168 INFO L87 Difference]: Start difference. First operand 1241 states and 2282 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:11,732 INFO L93 Difference]: Finished difference Result 1535 states and 2798 transitions. [2022-02-09 02:11:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 02:11:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:11,734 INFO L225 Difference]: With dead ends: 1535 [2022-02-09 02:11:11,734 INFO L226 Difference]: Without dead ends: 1521 [2022-02-09 02:11:11,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:11,735 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 294 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:11,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 543 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2022-02-09 02:11:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1240. [2022-02-09 02:11:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1233 states have (on average 1.8491484184914841) internal successors, (2280), 1239 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 2280 transitions. [2022-02-09 02:11:11,748 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 2280 transitions. Word has length 110 [2022-02-09 02:11:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:11,748 INFO L470 AbstractCegarLoop]: Abstraction has 1240 states and 2280 transitions. [2022-02-09 02:11:11,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2280 transitions. [2022-02-09 02:11:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:11,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:11,750 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:11,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-09 02:11:11,750 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1838837712, now seen corresponding path program 13 times [2022-02-09 02:11:11,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:11,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370628503] [2022-02-09 02:11:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:11,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:12,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:12,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370628503] [2022-02-09 02:11:12,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370628503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:12,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:12,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:12,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592738247] [2022-02-09 02:11:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:12,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:12,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:12,165 INFO L87 Difference]: Start difference. First operand 1240 states and 2280 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:12,776 INFO L93 Difference]: Finished difference Result 1582 states and 2889 transitions. [2022-02-09 02:11:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 02:11:12,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:12,778 INFO L225 Difference]: With dead ends: 1582 [2022-02-09 02:11:12,778 INFO L226 Difference]: Without dead ends: 1561 [2022-02-09 02:11:12,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:12,778 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 292 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:12,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 655 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 02:11:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-02-09 02:11:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1239. [2022-02-09 02:11:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1232 states have (on average 1.849025974025974) internal successors, (2278), 1238 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2278 transitions. [2022-02-09 02:11:12,790 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2278 transitions. Word has length 110 [2022-02-09 02:11:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:12,790 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 2278 transitions. [2022-02-09 02:11:12,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2278 transitions. [2022-02-09 02:11:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:12,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:12,792 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:12,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-09 02:11:12,792 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1577778106, now seen corresponding path program 14 times [2022-02-09 02:11:12,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:12,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375852290] [2022-02-09 02:11:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:12,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:13,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:13,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375852290] [2022-02-09 02:11:13,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375852290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:13,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:13,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:13,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560207955] [2022-02-09 02:11:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:13,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:13,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:13,085 INFO L87 Difference]: Start difference. First operand 1239 states and 2278 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:13,566 INFO L93 Difference]: Finished difference Result 1633 states and 2988 transitions. [2022-02-09 02:11:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 02:11:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:13,568 INFO L225 Difference]: With dead ends: 1633 [2022-02-09 02:11:13,568 INFO L226 Difference]: Without dead ends: 1605 [2022-02-09 02:11:13,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:13,569 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 302 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:13,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 477 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 02:11:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2022-02-09 02:11:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1238. [2022-02-09 02:11:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1231 states have (on average 1.8489033306255078) internal successors, (2276), 1237 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 2276 transitions. [2022-02-09 02:11:13,581 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 2276 transitions. Word has length 110 [2022-02-09 02:11:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:13,582 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 2276 transitions. [2022-02-09 02:11:13,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2276 transitions. [2022-02-09 02:11:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:13,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:13,583 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:13,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-09 02:11:13,584 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -934609174, now seen corresponding path program 15 times [2022-02-09 02:11:13,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:13,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625285759] [2022-02-09 02:11:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:13,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:13,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:13,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625285759] [2022-02-09 02:11:13,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625285759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:13,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:13,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:13,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057048614] [2022-02-09 02:11:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:13,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:13,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:13,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:13,892 INFO L87 Difference]: Start difference. First operand 1238 states and 2276 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:14,292 INFO L93 Difference]: Finished difference Result 1405 states and 2545 transitions. [2022-02-09 02:11:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 02:11:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:14,294 INFO L225 Difference]: With dead ends: 1405 [2022-02-09 02:11:14,294 INFO L226 Difference]: Without dead ends: 1373 [2022-02-09 02:11:14,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-02-09 02:11:14,295 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 217 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:14,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 540 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 02:11:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-02-09 02:11:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1168. [2022-02-09 02:11:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1161 states have (on average 1.8354866494401378) internal successors, (2131), 1167 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2131 transitions. [2022-02-09 02:11:14,306 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2131 transitions. Word has length 110 [2022-02-09 02:11:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:14,306 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2131 transitions. [2022-02-09 02:11:14,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2131 transitions. [2022-02-09 02:11:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:14,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:14,307 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:14,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-09 02:11:14,307 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1325303053, now seen corresponding path program 1 times [2022-02-09 02:11:14,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:14,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458240570] [2022-02-09 02:11:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:14,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:14,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:14,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458240570] [2022-02-09 02:11:14,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458240570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:14,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:14,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-09 02:11:14,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038185869] [2022-02-09 02:11:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:14,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 02:11:14,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:14,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 02:11:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:14,453 INFO L87 Difference]: Start difference. First operand 1168 states and 2131 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:14,994 INFO L93 Difference]: Finished difference Result 1478 states and 2645 transitions. [2022-02-09 02:11:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 02:11:14,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:14,996 INFO L225 Difference]: With dead ends: 1478 [2022-02-09 02:11:14,996 INFO L226 Difference]: Without dead ends: 1008 [2022-02-09 02:11:14,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2022-02-09 02:11:14,996 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 291 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:14,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 725 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 02:11:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-02-09 02:11:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 761. [2022-02-09 02:11:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 754 states have (on average 1.7758620689655173) internal successors, (1339), 760 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1339 transitions. [2022-02-09 02:11:15,004 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1339 transitions. Word has length 110 [2022-02-09 02:11:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:15,005 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1339 transitions. [2022-02-09 02:11:15,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1339 transitions. [2022-02-09 02:11:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:15,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:15,005 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:15,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-09 02:11:15,006 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash -661546646, now seen corresponding path program 16 times [2022-02-09 02:11:15,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:15,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985187491] [2022-02-09 02:11:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:15,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:15,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:15,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985187491] [2022-02-09 02:11:15,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985187491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:15,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:15,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:15,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602151154] [2022-02-09 02:11:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:15,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:15,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:15,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:15,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:15,207 INFO L87 Difference]: Start difference. First operand 761 states and 1339 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:15,446 INFO L93 Difference]: Finished difference Result 873 states and 1531 transitions. [2022-02-09 02:11:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 02:11:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:15,447 INFO L225 Difference]: With dead ends: 873 [2022-02-09 02:11:15,447 INFO L226 Difference]: Without dead ends: 822 [2022-02-09 02:11:15,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-02-09 02:11:15,448 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 202 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:15,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 328 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 02:11:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-02-09 02:11:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 774. [2022-02-09 02:11:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 767 states have (on average 1.75619295958279) internal successors, (1347), 773 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1347 transitions. [2022-02-09 02:11:15,455 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1347 transitions. Word has length 110 [2022-02-09 02:11:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:15,455 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1347 transitions. [2022-02-09 02:11:15,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1347 transitions. [2022-02-09 02:11:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:15,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:15,456 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:15,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-09 02:11:15,456 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1404654586, now seen corresponding path program 2 times [2022-02-09 02:11:15,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:15,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224598447] [2022-02-09 02:11:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:15,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:15,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:15,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224598447] [2022-02-09 02:11:15,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224598447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:15,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:15,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:15,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876066948] [2022-02-09 02:11:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:15,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:15,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:15,691 INFO L87 Difference]: Start difference. First operand 774 states and 1347 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:15,970 INFO L93 Difference]: Finished difference Result 874 states and 1531 transitions. [2022-02-09 02:11:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 02:11:15,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:15,971 INFO L225 Difference]: With dead ends: 874 [2022-02-09 02:11:15,971 INFO L226 Difference]: Without dead ends: 826 [2022-02-09 02:11:15,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-02-09 02:11:15,972 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 268 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:15,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 356 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 02:11:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-02-09 02:11:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 802. [2022-02-09 02:11:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 796 states have (on average 1.7613065326633166) internal successors, (1402), 801 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1402 transitions. [2022-02-09 02:11:15,979 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1402 transitions. Word has length 110 [2022-02-09 02:11:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:15,979 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1402 transitions. [2022-02-09 02:11:15,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1402 transitions. [2022-02-09 02:11:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:15,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:15,980 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:15,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-09 02:11:15,980 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 451291516, now seen corresponding path program 16 times [2022-02-09 02:11:15,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:15,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095684603] [2022-02-09 02:11:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:15,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:16,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:16,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095684603] [2022-02-09 02:11:16,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095684603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:16,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:16,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:16,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766814205] [2022-02-09 02:11:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:16,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:16,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:16,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:16,304 INFO L87 Difference]: Start difference. First operand 802 states and 1402 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:16,594 INFO L93 Difference]: Finished difference Result 902 states and 1591 transitions. [2022-02-09 02:11:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 02:11:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:16,595 INFO L225 Difference]: With dead ends: 902 [2022-02-09 02:11:16,595 INFO L226 Difference]: Without dead ends: 870 [2022-02-09 02:11:16,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-02-09 02:11:16,596 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 234 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:16,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 376 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 02:11:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2022-02-09 02:11:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 855. [2022-02-09 02:11:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 849 states have (on average 1.7750294464075382) internal successors, (1507), 854 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1507 transitions. [2022-02-09 02:11:16,603 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1507 transitions. Word has length 110 [2022-02-09 02:11:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:16,603 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1507 transitions. [2022-02-09 02:11:16,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1507 transitions. [2022-02-09 02:11:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:16,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:16,604 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:16,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-09 02:11:16,604 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 60597637, now seen corresponding path program 2 times [2022-02-09 02:11:16,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:16,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661871157] [2022-02-09 02:11:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:16,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:16,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:16,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661871157] [2022-02-09 02:11:16,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661871157] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:16,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:16,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:16,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088117329] [2022-02-09 02:11:16,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:16,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:16,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:16,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:16,775 INFO L87 Difference]: Start difference. First operand 855 states and 1507 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:17,219 INFO L93 Difference]: Finished difference Result 824 states and 1446 transitions. [2022-02-09 02:11:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 02:11:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:17,220 INFO L225 Difference]: With dead ends: 824 [2022-02-09 02:11:17,220 INFO L226 Difference]: Without dead ends: 498 [2022-02-09 02:11:17,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-02-09 02:11:17,220 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 195 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:17,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 487 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 02:11:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-09 02:11:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 474. [2022-02-09 02:11:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 471 states have (on average 1.6178343949044587) internal successors, (762), 473 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 762 transitions. [2022-02-09 02:11:17,224 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 762 transitions. Word has length 110 [2022-02-09 02:11:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:17,224 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 762 transitions. [2022-02-09 02:11:17,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 762 transitions. [2022-02-09 02:11:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:17,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:17,225 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:17,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-09 02:11:17,225 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1609272518, now seen corresponding path program 17 times [2022-02-09 02:11:17,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:17,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612757030] [2022-02-09 02:11:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:17,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:17,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:17,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612757030] [2022-02-09 02:11:17,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612757030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:17,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:17,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:17,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23241884] [2022-02-09 02:11:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:17,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:17,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:17,638 INFO L87 Difference]: Start difference. First operand 474 states and 762 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:18,225 INFO L93 Difference]: Finished difference Result 508 states and 804 transitions. [2022-02-09 02:11:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 02:11:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:18,226 INFO L225 Difference]: With dead ends: 508 [2022-02-09 02:11:18,226 INFO L226 Difference]: Without dead ends: 485 [2022-02-09 02:11:18,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-02-09 02:11:18,227 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 169 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:18,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 417 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 02:11:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-02-09 02:11:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2022-02-09 02:11:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 470 states have (on average 1.6170212765957446) internal successors, (760), 472 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 760 transitions. [2022-02-09 02:11:18,231 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 760 transitions. Word has length 110 [2022-02-09 02:11:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:18,231 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 760 transitions. [2022-02-09 02:11:18,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 760 transitions. [2022-02-09 02:11:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:18,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:18,232 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:18,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-09 02:11:18,232 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 662589142, now seen corresponding path program 18 times [2022-02-09 02:11:18,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:18,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475078132] [2022-02-09 02:11:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:18,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:18,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:18,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475078132] [2022-02-09 02:11:18,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475078132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:18,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:18,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:18,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817598145] [2022-02-09 02:11:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:18,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:18,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:18,489 INFO L87 Difference]: Start difference. First operand 473 states and 760 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:18,936 INFO L93 Difference]: Finished difference Result 529 states and 845 transitions. [2022-02-09 02:11:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 02:11:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:18,937 INFO L225 Difference]: With dead ends: 529 [2022-02-09 02:11:18,937 INFO L226 Difference]: Without dead ends: 484 [2022-02-09 02:11:18,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-02-09 02:11:18,937 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 176 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:18,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 322 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 02:11:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-02-09 02:11:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 472. [2022-02-09 02:11:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 469 states have (on average 1.6162046908315566) internal successors, (758), 471 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 758 transitions. [2022-02-09 02:11:18,941 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 758 transitions. Word has length 110 [2022-02-09 02:11:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:18,941 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 758 transitions. [2022-02-09 02:11:18,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 758 transitions. [2022-02-09 02:11:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:18,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:18,942 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:18,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-09 02:11:18,942 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1067647484, now seen corresponding path program 19 times [2022-02-09 02:11:18,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:18,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046532039] [2022-02-09 02:11:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:18,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:19,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:19,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046532039] [2022-02-09 02:11:19,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046532039] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:19,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:19,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:19,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416607583] [2022-02-09 02:11:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:19,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:19,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:19,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:19,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:19,190 INFO L87 Difference]: Start difference. First operand 472 states and 758 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:19,554 INFO L93 Difference]: Finished difference Result 550 states and 886 transitions. [2022-02-09 02:11:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 02:11:19,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:19,555 INFO L225 Difference]: With dead ends: 550 [2022-02-09 02:11:19,555 INFO L226 Difference]: Without dead ends: 483 [2022-02-09 02:11:19,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2022-02-09 02:11:19,555 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 193 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:19,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 308 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 02:11:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-09 02:11:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 471. [2022-02-09 02:11:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 468 states have (on average 1.6153846153846154) internal successors, (756), 470 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 756 transitions. [2022-02-09 02:11:19,560 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 756 transitions. Word has length 110 [2022-02-09 02:11:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:19,560 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 756 transitions. [2022-02-09 02:11:19,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 756 transitions. [2022-02-09 02:11:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:19,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:19,560 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:19,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-09 02:11:19,561 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -562587324, now seen corresponding path program 20 times [2022-02-09 02:11:19,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:19,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413687722] [2022-02-09 02:11:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:19,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 02:11:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 02:11:19,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 02:11:19,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413687722] [2022-02-09 02:11:19,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413687722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 02:11:19,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 02:11:19,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-09 02:11:19,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010282267] [2022-02-09 02:11:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 02:11:19,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 02:11:19,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 02:11:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 02:11:19,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-02-09 02:11:19,792 INFO L87 Difference]: Start difference. First operand 471 states and 756 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 02:11:20,127 INFO L93 Difference]: Finished difference Result 464 states and 740 transitions. [2022-02-09 02:11:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 02:11:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 110 [2022-02-09 02:11:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 02:11:20,128 INFO L225 Difference]: With dead ends: 464 [2022-02-09 02:11:20,128 INFO L226 Difference]: Without dead ends: 371 [2022-02-09 02:11:20,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2022-02-09 02:11:20,129 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 154 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 02:11:20,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 338 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 02:11:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-02-09 02:11:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2022-02-09 02:11:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 357 states have (on average 1.57703081232493) internal successors, (563), 358 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 563 transitions. [2022-02-09 02:11:20,132 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 563 transitions. Word has length 110 [2022-02-09 02:11:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 02:11:20,132 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 563 transitions. [2022-02-09 02:11:20,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 02:11:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 563 transitions. [2022-02-09 02:11:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 02:11:20,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 02:11:20,133 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-09 02:11:20,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-09 02:11:20,133 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 02:11:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 02:11:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2078749440, now seen corresponding path program 17 times [2022-02-09 02:11:20,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 02:11:20,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933631373] [2022-02-09 02:11:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 02:11:20,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 02:11:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-02-09 02:12:38,003 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2022-02-09 02:12:38,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-09 02:12:38,004 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-13-3-24-3-21-3-17-3-13-3-9-3-5-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-3-6-3-5-3-3-1 context. [2022-02-09 02:12:38,007 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2022-02-09 02:12:38,007 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-02-09 02:12:38,007 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2022-02-09 02:12:38,007 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2022-02-09 02:12:38,008 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2022-02-09 02:12:38,008 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2022-02-09 02:12:38,010 INFO L732 BasicCegarLoop]: Path program histogram: [20, 17, 2, 2, 2, 2, 2, 1, 1, 1] [2022-02-09 02:12:38,012 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 02:12:38,012 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 02:12:38,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 02:12:38 BasicIcfg [2022-02-09 02:12:38,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 02:12:38,014 INFO L158 Benchmark]: Toolchain (without parser) took 850338.45ms. Allocated memory was 198.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 145.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-02-09 02:12:38,014 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 02:12:38,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.14ms. Allocated memory is still 198.2MB. Free memory was 145.6MB in the beginning and 156.6MB in the end (delta: -10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-09 02:12:38,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.65ms. Allocated memory is still 198.2MB. Free memory was 156.6MB in the beginning and 153.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-09 02:12:38,014 INFO L158 Benchmark]: Boogie Preprocessor took 30.66ms. Allocated memory is still 198.2MB. Free memory was 153.4MB in the beginning and 151.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 02:12:38,015 INFO L158 Benchmark]: RCFGBuilder took 504.81ms. Allocated memory is still 198.2MB. Free memory was 151.8MB in the beginning and 136.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-09 02:12:38,015 INFO L158 Benchmark]: TraceAbstraction took 849268.45ms. Allocated memory was 198.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 135.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-02-09 02:12:38,015 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.10ms. Allocated memory is still 198.2MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.14ms. Allocated memory is still 198.2MB. Free memory was 145.6MB in the beginning and 156.6MB in the end (delta: -10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.65ms. Allocated memory is still 198.2MB. Free memory was 156.6MB in the beginning and 153.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.66ms. Allocated memory is still 198.2MB. Free memory was 153.4MB in the beginning and 151.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 504.81ms. Allocated memory is still 198.2MB. Free memory was 151.8MB in the beginning and 136.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 849268.45ms. Allocated memory was 198.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 135.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.8GB. 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: 943]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-13-3-24-3-21-3-17-3-13-3-9-3-5-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-3-6-3-5-3-3-1 context. - TimeoutResultAtElement [Line: 943]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-13-3-24-3-21-3-17-3-13-3-9-3-5-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-3-6-3-5-3-3-1 context. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-13-3-24-3-21-3-17-3-13-3-9-3-5-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-3-6-3-5-3-3-1 context. - TimeoutResultAtElement [Line: 931]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-13-3-24-3-21-3-17-3-13-3-9-3-5-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-3-6-3-5-3-3-1 context. - TimeoutResultAtElement [Line: 931]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-13-3-24-3-21-3-17-3-13-3-9-3-5-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-3-6-3-5-3-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 138 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 849.1s, OverallIterations: 50, TraceHistogramMax: 10, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.1s, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9774 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9774 mSDsluCounter, 25957 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 246 IncrementalHoareTripleChecker+Unchecked, 19561 mSDsCounter, 3913 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24571 IncrementalHoareTripleChecker+Invalid, 28730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3913 mSolverCounterUnsat, 6492 mSDtfsCounter, 24571 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 897 SyntacticMatches, 14 SemanticMatches, 850 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3596 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1242occurred in iteration=35, InterpolantAutomatonStates: 669, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 49 MinimizatonAttempts, 12127 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 740.7s InterpolantComputationTime, 5524 NumberOfCodeBlocks, 5424 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 5757 ConstructedInterpolants, 16 QuantifiedInterpolants, 53870 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1111 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 60 InterpolantComputations, 46 PerfectInterpolantSequences, 10021/11228 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